A Provably Secure Signature Scheme based on Factoring and Discrete Logarithms
نویسندگان
چکیده
To make users put much confidence in digital signatures, this paper proposes the first provably secure signature scheme based on both factoring and discrete logarithms. The new scheme incorporates both the Schnorr signature scheme and the PSS-Rabin signature scheme. Unless both the two cryptographic assumptions could be become solved simultaneously, anyone would not forge any signature. The proposed scheme is efficient since the computation requirement and the storage requirement are slightly larger than those for the Schnorr signature scheme and the PSS-Rabin signature scheme.
منابع مشابه
New ID-Based Digital Signature Scheme on Factoring and Discrete Logarithms
The past years have seen many attempts to construct identity based signature schemes on a single hard problem, like factoring or discrete logarithms. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new identification based signature scheme on factoring (FAC) problem and discret...
متن کاملProvably Secure and Practical Identification Schemes and Corresponding Signature Schemes
This paper presents a three-move interactive identification scheme and proves it to be as secure as t h e discrete logarithm problem. This provably secure scheme is almost as efficient as t,he Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem ar...
متن کاملA new digital signature scheme based on factoring and discrete logarithms
Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes a...
متن کاملA New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on fact...
متن کاملNovel Digital Signature Schemes based on Factoring and Discrete Logarithms
In the paper, we propose a new digital signature scheme based on factoring and discrete logarithms. Specially, we prove that the security of the proposed signature scheme is based on both the security of the ElGamal signature scheme and the security of the modified OSS signature scheme. This is the first scheme which can be proved that its security is based on two hard problems. Like Meta-ElGam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014